Application Semantics for Active Monotonic Database Applications
نویسندگان
چکیده
We refine an active-database application taxonomy, proposed by Stonebraker, to include monotonic log monitoring applications (MLM). MLMs are a subclass of hard rule systems where triggering events are restricted to monotonic relations. We develop a formal semantic model for the MLM class. We then prove the correctness of concurrency schemes for applications within the model. Our results demonstrate that only minimal coupling mode support is necessary for the database integration of hard rule systems obeying the MLM restrictions.
منابع مشابه
Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory
Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning. In this pap...
متن کاملA Unified Semantics for Active and Deductive Databases
These two rule-oriented paradigms of databases have been the focus of extensive research and are now coming of age in the commercial DBMS world. However, the systems developed so far support well only one of the two paradigms|thus limiting the eeectiveness of such systems in many applications that require complete integration of both kinds of rules. In this paper, we discuss the technical probl...
متن کاملDeclarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کامل4 Conclusions and Future Directions Example 5 Existential Query Example 6 Intelligent Backtracking. 3 Compilation and Execution Example 4 Rule Compression and Literal Collapsing for Aggregate Operators Example 3 Built-in Aggregate Operators Example 2 Sql Generation
The well-founded semantics for general logic programs. 11 Therefore using choice and stratiied negation it is possible to express all algorithms that can be computed in time which is polynomial in the size of the database 7]. Now, while the declarative semantics of choice rests on the theoretical foundations of non-monotonic logic, a programmer need not be cognizant of the notion of stable mode...
متن کاملGraph Queries in a Next-Generation Datalog System
Recent theoretical advances have enabled the use of special monotonic aggregates in recursion. These special aggregates make possible the concise expression and efficient implementation of a rich new set of advanced applications. Among these applications, graph queries are particularly important because of their pervasiveness in data intensive application areas. In this demonstration, we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000